#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 2e5+10;
#define INF 0x3f3f3f3f;
typedef long long int ll;
#define sd(n) scanf("%d",&n) 
#define sld(n) scanf("%lld",&n)
#define pd(n) printf("%d", (n))
#define pld(n) printf("%lld", n)

//----------------------------------------------------------------------------//

void solve()
{
	
	
	
}

int main()
{
	int T; sd(T);
	while (T--) solve();
	return 0;
}



//升序排序
int compare1 (const void *a, const void *b)
{
    return ( *(int *)a - * (int *)b );
}
//降序排列
int compare2 (const void *a, const void *b)
{
    return ( *(int *)b - * (int *)a );
}
 

int main()
{

    int a[6] = {25, 777, 11, 21, 65, 43};

    qsort(a, 6, sizeof(int), compare1);

    for(int i = 0; i < sizeof(a) / sizeof(a[0]); i++) cout << a[i] << " ";
    cout << '\n';

    return 0;
}




//合理利用getchar刷新
tt = getchar();
scanf("%c", &s);
tt = getchar();
scanf("%c", &e);
tt = getchar();
scanf("%s", a);




